Linear-Time Poisson-Disk Patterns

Linear-Time Poisson-Disk Patterns

We present an algorithm for generating Poisson-disk patterns takingO(N) time to generateN points. The method is based on a grid of regions which can contain no more than one point in the final pattern, and uses an explicit model of point arrival times under a uniform Poisson process.

Efficient Generation of Poisson-Disk Sampling Patterns

Poisson Disk sampling patterns are of interest to the graphics community because their blue-noise properties are desirable in sampling patterns for rendering, illumination, and other computations. Until now, such patterns could only be generated by slow methods with poor convergence, or could only be approximated by jittering individual samples or tiling sets of samples. We present a simple and...

Using Scalloped Sectors to Generate Poisson-Disk Sampling Patterns

Sampling distributions with blue noise characteristics are widely used in computer graphics. Although Poisson-disk distributions are known to have excellent blue noise characteristics, they are generally regarded as too computationally expensive to generate in real time. We present a new data structure that alllows sampling by dart-throwing in O(N logN) time. We also show how a novel and effici...

Maximal Poisson - Disk Sampling ( MPS )

Variable Radii Poisson Disk Sampling

We introduce three natural and well-defined generalizations of maximal Poisson-disk sampling. The first is to decouple the disk-free (inhibition) radius from the maximality (coverage) radius. Selecting a smaller inhibition radius than the coverage radius yields samples which mix advantages of Poisson-disk and uniform-random samplings. The second generalization yields hierarchical samplings, by ...